Multi-robot area patrol under frequency constraints
نویسندگان
چکیده
منابع مشابه
Multi-robot routing under connectivity constraints
This paper addresses the problem of routing multiple range constrained robots to service spatially distributed requests at specified time instants, while ensuring a connected information exchange network at all times. We discuss the feasibility aspects of such a connectivity constrained routing problem. In particular, we derive the minimum number of robots required to service such requests, and...
متن کاملCoordinated Multi-Robot Exporation under Connectivity Constraints
This paper addresses the exploration problem for a multi-robot system subject to constraints imposed by the communication network. Our goal is to develop a decentralized approach that leads each robot towards the frontier while keeping connectivity with the neighbors. A frontier is a part of the environment, which divides explored from unexplored space. We make use of a graph theory for charact...
متن کاملCooperative multi-robot patrol with Bayesian learning
Patrolling indoor infrastructures with a team of cooperative mobile robots is a challenging task, which requires effective multi-agent coordination. Deterministic patrol circuits for multiple mobile robots have become popular due to their exceeding performance. However their predefined nature does not allow the system to react to changes in the system’s conditions or adapt to unexpected situati...
متن کاملMulti-Robot Fence Patrol in Adversarial Domains
This paper considers the problem of multi-robot patrolling along an open polyline, for example a fence, in the presence of an adversary trying to penetrate through the fence. In this case, the robots’ task is to maximize the probability of detecting penetrations. Previous work concerning multi-robot patrol in adversarial environments considered closed polygons. That situation is simpler to eval...
متن کاملAdversarial Uncertainty in Multi-Robot Patrol
We study the problem of multi-robot perimeter patrol in adversarial environments, under uncertainty of adversarial behavior. The robots patrol around a closed area using a nondeterministic patrol algorithm. The adversary’s choice of penetration point depends on the knowledge it obtained on the patrolling algorithm and its weakness points. Previous work investigated full knowledge and zero knowl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 2009
ISSN: 1012-2443,1573-7470
DOI: 10.1007/s10472-010-9193-y